From non-preemptive to preemptive scheduling using synchronization synthesis

From non-preemptive to preemptive scheduling using synchronization synthesis

We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of ca...

From Preemptive to Non-preemptive Scheduling Using Rejections

We study the classical problem of scheduling a set of independent jobs with release dates on a single machine. There exists a huge literature on the preemptive version of the problem, where the jobs can be interrupted at any moment. However, we focus here on the non-preemptive case, which is harder, but more relevant in practice. For instance, the jobs submitted to actual high performance platf...

From Preemptive to Non-preemptive Speed-Scaling Scheduling

We are given a set of jobs, each one specified by its release date, its deadline and its processing volume (work), and a single (or a set of) speed-scalable processor(s). We adopt the standard model in speed-scaling in which if a processor runs at speed s then the energy consumption is s units of energy per time unit, where α > 1 is a small constant. Our goal is to find a schedule respecting th...

Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling

An Efficient Non-Preemptive Real-Time Scheduling

Traditional real-time systems are designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time systems, particularly for soft real-time multimedia applications. In this paper we propose a new algorithm that uses multiple scheduling strateg...